College of Computing and Informatics - Department of Computer Science and Engineering

  • Professor Data Intensive Computing
  • NAM, BEOMSEOK
    Lab Data Intensive Computing
  • +82-31-290-7967
  • Research & Business Center 5F 85566

Research Interest

Data Intensive Computing, Computer Systems, Distributed and Parallel Computing

Education

  • Ph.D. University of Maryland, College Park, 2007
  • M.S./B.S. Seoul National University

Experience

  • UNIST (Ulsan National Institute of Science and Technology), 20010-2018
  • Oracle USA, 2007-2010

Journal Articles

  • (2022)  Pivotal B plus tree for Byte-Addressable Persistent Memory.  IEEE ACCESS.  10,  -
  • (2021)  Failure-Atomic Byte-Addressable R-tree for Persistent Memory.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS.  32,  3
  • (2021)  Failure-Atomic Byte-Addressable R-tree for Persistent Memory.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS.  32,  3
  • (2020)  B-3-Tree: Byte-Addressable Binary B-Tree for Persistent Memory.  ACM TRANSACTIONS ON STORAGE.  16,  3
  • (2018)  clfB-tree: Cacheline Friendly Persistent B-tree for NVRAM.  ACM TRANSACTIONS ON STORAGE.  14,  1
  • (2018)  Co-processing heterogeneous parallel index for multi-dimensional datasets..  JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING.  113, 

Conference Paper

  • (2023)  NV-SQL: Boosting OLTP Performance with Non-Volatile DIMMs.  International Conference on Very Large Databases.  CANADA
  • (2023)  NVMe-Driven Lazy Cache Coherence for Immutable Data with NVMe over Fabrics.  IEEE International Conference on Cloud Computing.  UNITED STATES
  • (2023)  On Stacking a Persistent Memory File System on Legacy File Systems.  USENIX Conference on File and Storage Technologies.  UNITED STATES
  • (2022)  In-Page Shadowing and Two-Version Timestamp Ordering for Mobile DBMSs.  International Conference on Very Large Databases.  AUSTRALIA
  • (2022)  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory.  USENIX Symposium on Operating Systems Design and Implementation.  UNITED STATES
  • (2022)  VeloxDFS: Streaming Access to Distributed Datasets to Reduce Disk Seeks.  IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing.  ITALY
  • (2020)  BoLT: Barrier-optimized LSM-Tree.  ACM/IFIP MIDDLEWARE (BKCSA083).  NETHERLANDS
  • (2020)  Doubleheader Logging: Eliminating Journal Write Overhead for Mobile DBMS.  International Conference on Data Engineering.  UNITED STATES
  • (2020)  FAST and FAIR B+-Tree for Byte-Addressable Persistent Memory.  10th Annual Non-Volatile Memories Workshop.  UNITED STATES
  • (2020)  SLM-DB: Single-Level Key-Value Store with Persistent Memory.  USENIX Conference on File and Storage Technologies.  UNITED STATES
  • (2019)  Write-Optimized Dynamic Hashing for Persistent Memory.  USENIX Conference on File and Storage Technologies.  UNITED STATES
  • (2019)  SLM-DB: Single-Level Key-Value Store with Persistent Memory.  USENIX Conference on File and Storage Technologies.  UNITED STATES
  • (2019)  Write-Optimized Dynamic Hashing for Persistent Memory.  USENIX Conference on File and Storage Technologies.  UNITED STATES
  • (2018)  CAVA: Exploring Memory Locality for Big Data Analytics in Virtualized Clusters.  IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2018).  UNITED STATES
  • (2018)  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree.  16th USENIX Conference on File and Storage Technologies (FAST 18).  UNITED STATES